Location:
Search - MAX MIN
Search list
Description: Heaps where the parent key is greater than or equal to (≥) the child keys are called max-heaps those where it is less than or equal to (≤) are called min-heaps. Efficient (logarithmic time) algorithms are known for the two operations needed to implement a priority queue on a binary heap: inserting an element, and removing the smallest (largest) element a min-heap (max-heap). Binary heaps are also commonly employed in the heapsort sorting algorithm, which is an in-place algorithm owing to the fact that binary heaps can be implemented as an implicit data structure, storing keys in an array and using their relative positions within that array to represent child-parent relationships.-Heaps where the parent key is greater than or equal to (≥) the child keys are called max-heaps those where it is less than or equal to (≤) are called min-heaps. Efficient (logarithmic time) algorithms are known for the two operations needed to implement a priority queue on a binary heap: inserting an element, and removing the smallest (largest) element a min-heap (max-heap). Binary heaps are also commonly employed in the heapsort sorting algorithm, which is an in-place algorithm owing to the fact that binary heaps can be implemented as an implicit data structure, storing keys in an array and using their relative positions within that array to represent child-parent relationships.
Platform: |
Size: 1024 |
Author: Carabian Ovidiu |
Hits:
Description: pso粒子群算法
他是一个实现Common，Clerc 1“的PSO工具箱
Trelea类型以及跟踪更改的alpha版本环境。 它可以搜索最小，最大或“距离”
用户开发成本函数。 很容易使用和黑客
相当好的文档（类型帮助任何功能和
它应该告诉你你需要什么），并将利用
矢量化成本函数。 它使用与Matlab类似的语法
优化工具箱。 包括静态和动态的套件测试功能。 它还包括一个专用的基于PSO的神经元网络教练与Mathwork的神经网络工具箱一起使用。-his is a PSO toolbox implementing Common, Clerc 1 , and
Trelea types along with an alpha version of tracking changing
environments. It can search for min, max, or distance of
user developed cost function. Very easy to use and hack with
reasonably good documentation (type help for any function and
it should tell you what you need) and will take advantage of
vectorized cost functions. It uses similar syntax to Matlab s
optimization toolbox. Includes a suite of static and dynamic
test functions. It also includes a dedicated PSO based neural
network trainer for use with Mathwork s neural network toolbox.
Platform: |
Size: 738304 |
Author: mr.chen |
Hits:
Description: 实现一段数字中的最大的数字和最小的数字的位置的交换(Realize the exchange of the max number and the min number.)
Platform: |
Size: 11264 |
Author: 阿瓦隆
|
Hits:
Description: 对图片应用利用max，min等函数求阈值分割点，最后转化为二值化图像，去噪后利用中值滤波处理再除噪，找出光斑中心位置和半径。(After binaryzation of the image processing, and then remove noise, find the center of the spot and radius)
Platform: |
Size: 3072 |
Author: Liu60
|
Hits:
Description: Utilities for C++ std::vector conatiners.
Mean of the data,
Max and min values of the data
Diff-functions for differences between samples in the vector
Sum of the data
Mean of the data
Platform: |
Size: 3072 |
Author: misiaczek
|
Hits:
Description: This is about min and max function
Platform: |
Size: 7168 |
Author: mimo2
|
Hits:
Description: web design for creativestudio
Platform: |
Size: 3828736 |
Author: ahmadsz
|
Hits:
Description: Grid cell min.max.and determine between value
Platform: |
Size: 251904 |
Author: mondra
|
Hits:
Description: Max & Min Filter on noisy images in MATLAB
Platform: |
Size: 135168 |
Author: zahrakh
|
Hits:
Description: NSGA2 COMPROMISE MIN MAX VALUE BY OBJECTIVE
Platform: |
Size: 167936 |
Author: PONGSAK |
Hits:
Description: 用来记录各个商店的营业额情况 计算平均数以及最小大值 并且记录非常规营业额的原因(sales log to record the sales of stores in a chain business, and also have the min/max sales)
Platform: |
Size: 226304 |
Author: linzy——00 |
Hits:
Description: 对于实序列??[??]=??????(????/??)，???≤??≤????；计算出??(??????)。并对x[n]作奇偶分量分解，分别计算出奇、偶分量的频谱????(??????)与谱 ????(??????)。
（1）频率计算范围：-pi~pi，频率步长设置：pi/800；
（2）分别画出：x[n]的频谱实部、x[n]的频谱虚部、偶分量的频谱实部、偶分量的频谱虚部、奇分量的频谱实部、奇分量的频谱虚部；排列方式如图所示；
（3）6个图的横坐标对pi作归一化处理，显示范围设置为：-1~1
6个图的纵坐标显示范围：min~max(Draw the real part of the spectrum of x[n], the imaginary part of spectrum of x[n], the real part of the spectrum of the even part, the imaginary part of the spectrum of the even part, the real part of the spectrum of the odd part, and the imaginary part of the spectrum of the odd part; The arrangement is as shown in the figure;
(3) The abscissa of the six graphs is normalized to pi and the display range is set to: -1~1
The y-coordinate display range of 6 maps: min~max)
Platform: |
Size: 124928 |
Author: Ky_Brave |
Hits:
Description: vector.h中实现了类模板Vector，代码按照C++11标准编写，支持C++11诸多新特性。
* 构造：预定义规模构造、右值构造、使用初始化列表构造、迭代器复制构造、向量整体复制构造、
向量区间复制构造……
* 迭代：支持基于范围的迭代，提供类Javascript迭代器的迭代方式。
* 运算符重载： = / [] / ==
* 基本操作：Size(), Capacity(), Empty(), Clear(), Reserve(), Resize(), Push(),
Pop(), Assign(), Remove(), Min(), Max()……
* 排序、搜索算法(The class template Vector is implemented in vector.h. The code is written in accordance with C++11 standard, supporting many new features of C++11.
* structure: predefined scale structure, right value structure, use initialization list construction, iterator replication construction, vector whole replication construction,
Vector interval replication construction...
* iterations: support for range based iterations, providing iterative methods for class Javascript iterators.
* operator overloading: = / [] / = = =
* basic operations: Size (), Capacity (), Empty (), Clear (), Reserve (), Resize (), Push (),Pop (), Assign (), Remove (), Min (), Max ()...
* sort and search algorithm)
Platform: |
Size: 5120 |
Author: Somo |
Hits:
Description: 1．顺序表的验证
（1）编写测试函数，对顺序表类模板用2种简单类型的数据（int ,char,double,float等）进行测试验证。
（2）定义一个结构体，描述学生信息。学生信息包括：学号、姓名、性别、班级和电话号码等。用描述学生信息的结构体作为线性表的数据元素类型测试顺序表。
（3）在顺序表类模板中增加成员函数max()和min()，它们分别返回顺序表中元素值最大的数据元素序号。
2．单链表的验证
（1）编写测试函数，对带头结点的单链表类模板用2种简单类型的数据（int ,char,double,float等）进行测试验证。
（2）定义一个结构体，描述学生信息。学生信息包括：学号、姓名、性别、班级和电话号码等。用描述学生信息的结构体作为线性表的数据元素类型测试带头结点的单链表。
（3）修改带头结点的单链表类模板中的插入函数，插入元素时按元素值从小到大的顺序插入数据元素到链表的适当位置。(1. Verification of Sequence Table
(1) Write test functions to test and verify the sequential table template with two simple types of data (int, char, double, float, etc.).
(2) Define a structure to describe student information. Student information includes: student number, name, gender, class and telephone number, etc. The structure describing students'information is used as the test sequence table of data element type in linear table.
(3) The member functions Max () and min () are added to the class template of the sequence table, which return the ordinal number of the data element with the largest element value in the sequence table, respectively.)
Platform: |
Size: 12288 |
Author: 咸鱼2333 |
Hits:
Description: 用中规模MSI基本逻辑功能模块 实现关模比较器（要求分别使用中规模和语言实现）：
功能要求：它的输入是两个8位无符号二进制整数X和Y，以及一个控制信号S；输出信号为1个8位无符号二进制整数Z。输入输出关系为：当S=1时， Z=min(X,Y)；当S=0时， Z=max(X,Y)。(Modeling comparator is implemented by using basic logic function modules of medium-scale MSI (medium-scale and language are required respectively):
Functional requirements: Its input is two 8-bit unsigned binary integers X and Y, and a control signal S; the output signal is an 8-bit unsigned binary integer Z. The relationship between input and output is: when S = 1, Z = min (X, Y); when S = 0, Z = max (X, Y).)
Platform: |
Size: 10240 |
Author: 瘾1581 |
Hits:
Description: 主要对比了干扰对齐算法中，最大信干噪比算法，交替最小化算法，最小干扰泄露算法，并且通过改变天线数量，用户数量，自由度，观察三种算法性能(alignment algorithms including max-SINR,min-WIL,min-ALT)
Platform: |
Size: 174080 |
Author: candy is coming |
Hits:
Description: 缠论主图中枢买卖点 副图MACD背离 MACD面积
几点说明：
1.指标不加密，下载别人的指标发现不能正确显示，所以自己整理了一下。
2.主副图均含未来函数。
3.无时间限制。
4.非严格笔段，但对缠论结构的判断影响不大，不喜勿下。MACD可以显示背驰和面积和三次金叉。
5.请将DLLS文件解压到通达信安装目录下的T0002\dlls文件夹中。(H1:=MAX(DYNAINFO(3),DYNAINFO(5));
L1:=MIN(DYNAINFO(3),DYNAINFO(6));
P1:=H1-L1;)
Platform: |
Size: 21504 |
Author: wasbocai |
Hits:
Description: 缠论顶底背驰副图，
红线为底线，绿线为顶线，出箭头为参考买卖点。
对于长期跟踪的个股，可作为滚动操作买卖参考。(H1:=MAX(DYNAINFO(3),DYNAINFO(5));
L1:=MIN(DYNAINFO(3),DYNAINFO(6));
P1:=H1-L1;)
Platform: |
Size: 1024 |
Author: wasbocai |
Hits:
Description: We propose a tractable expression for the
outage probability in single-cell uplink non-orthogonal multiple access (NOMA) systems serving an arbitrary number of
users. The expression is obtained by approximating the interuser interference using a shifted-gamma distributed random
variable. We then formulate and propose an efficient iterative
algorithm for the outage-constrained min–max power allocation
problem for the NOMA system. To give a rigorous comparison, we solve the outage-constrained min–max power allocation
problem for the orthogonal multiple access (OMA) counterpart
where both the user power allocation and the radio resource
division pattern are optimized. Simulations confirm the accuracy
of the derived outage probability expression for the NOMA
system. Also, we demonstrate that fairness among users in terms
of transmission power can be achieved by NOMA. Moreover,
NOMA can bring significant power savings to the users as
compared with OMA
Platform: |
Size: 569822 |
Author: dipfr@yahoo.fr |
Hits:
«
1
2
...
16
17
18
19
20
21»